The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We propose the concept of “the classification and boundary problem” and review a few types of reasonings in our daily life from the angle of this problem. As a typical example, we treat the topic of a realization of non-monotonic reasoning based on a logic programming.
Because of the lack of general semantics for non-monotonic formalisms, the relationship between the major forms of non-monotonic formalisms has not been understood very well. Recently, it has been proposed by C.Przymusinski that perfect model semantics for logic programming is also suitable for some special cases of non-monotonic formalisms. The importance of this result is not only for shedding new...
In first order predicate logic, it is undecidable whether a formula is deducible from a set of axioms. In order to realize a practical knowledge base system in the framework of the first order logic, we must overcome this problem. In this paper, we propose a time-bounded reasoning and investigate the properties of the knowledge base management system based on our time-bounded reasoning. We...
In this paper, we give a theoretical foundation of EFS (elementary formal system) as a logic programming language. We show that the set of all the unifiers of two atoms is finite and computable by restricting the form of axioms and goals without losing generality. The restriction makes the negation as failure rule complete. We give two conditions of EFS's such that the negation as failure rule is...
For the programming environment of a parallel logic programming language, it is an important problem to develop a debugger. However it is difficult to debug parallel programs by observing their execution traces. Using the characteristics of logic programming languages, one solution to this problem is debugging using declarative semantics programs. However parallel logic programming languages (Concurrent...
Tomita's algorithm [Tomita 85] which treats context free grammars makes use of the breadth-first strategy to handle conflicts occurring in a LR parsing table. Considering the compatibility of a breadth-first strategy with parallel processing, we developed a parallel generalized LR parser called PLR, whose algorithm is based on Tomita's algorithm. PLR is implemented in GIIC[Ueda 85] that is a concurrent...
Knowledge Media Station aims at an active medium which not only stores and utilizes knowledge represented by a well-formulated language, but also enables users to incorporate and organize this knowledge together with various types of knowledge using a hypermedia framework. Knowledge Media Station consists of a Knowledge Processor, Inference Engine and Hypermedia. In the Inference Engine, we have developed...
This paper presents a symbolic constraint logic programming language cu-Prolog, and shows a simple Japanese parser based on JPSG (Japanese Phrase Structure Grammar) as a suitable application. cu-Prolog employs constraint unification instead of the ordinary unification, and handles symbolic constraints in terms of user-defined predicates. The program clause of cu-Prolog is an expansion of Horn...
Various improvements have been made to the Bottom Up Parser in Prolog (BUP for short), such as speed up of processing time, describability for Extraposition Grammars and idioms and so on. In this paper, we present another speed up method without spoiling these assets. The original BUP has no particular mechanism to choose one production rule deterministically; however, in our method the parser...
In this paper, we propose a mechanism for maintaining consistency of subjective judgments. In the mechanism, subjective judgments of decision makers are extracted and used to select alternatives effectively. The subjective judgments are quantified by using AHP based pairwise comparisons. In order to maintain consistency of the comparisons, we exploit the TMS based nonmonotonic inference in the Prolog-based...
In this work, a logic design assistance system using Tokio is presented. Tokio is a logic programming language which is based on Interval Temporal Logic. Therefore, Tokio can specify both concurrency and sequentiality accurately and easily. In this system, the behaviors at both the algorithmic level and the register transfer level are given in the same language: Tokio. This is one of the most outstanding...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.